#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
bool cmp(LL A,LL B){return A>B;}
void pri(LL x,LL k,LL n){
    LL temp=n;
    for(LL i=1;i<=k-1;i++){
        cout<<i*x<<" ";
        temp-=i*x;
    }
    cout<<temp<<"\n";
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,k;cin>>n>>k;
   if(k>=1e6) {cout<<"-1"<<"\n";return 0;}
   LL sum=(1+k)*k/2;
   vector<LL>v;
   LL res=n;
   for(LL i=1;i<=sqrt(res);i++){
       if(res%i==0){
          if(i*i==res){
             v.push_back(i);
          }
          else v.push_back(i),v.push_back(res/i);
       }
   }
   bool flag=1;
   sort(v.begin(),v.end(),cmp);
   for(auto i:v){
       if(n/i>=sum){
           pri(i,k,n);
           flag=0;
           break;
       }
   }
   if(flag){
      cout<<"-1"<<"\n";
   }
   return 0;
}
